The M/G/∞ estimation problem revisited
نویسنده
چکیده
The subject of this paper is the M/G/∞ estimation problem: the goal is to estimate the service time distribution G of the M/G/∞ queue from the arrival–departure observations without identification of customers. We develop estimators of G and derive exact non–asymptotic expressions for their mean squared errors. The problem of estimating the service time expectation is addressed as well. We present some numerical results on comparison of different estimators of the service time distribution. Short Title: The M/G/∞ estimation problem
منابع مشابه
SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملSimultaneous robust estimation of multi-response surfaces in the presence of outliers
A robust approach should be considered when estimating regression coefficients in multi-response problems. Many models are derived from the least squares method. Because the presence of outlier data is unavoidable in most real cases and because the least squares method is sensitive to these types of points, robust regression approaches appear to be a more reliable and suitable method for addres...
متن کاملModeling of the Maximum Entropy Problem as an Optimal Control Problem and its Application to Pdf Estimation of Electricity Price
In this paper, the continuous optimal control theory is used to model and solve the maximum entropy problem for a continuous random variable. The maximum entropy principle provides a method to obtain least-biased probability density function (Pdf) estimation. In this paper, to find a closed form solution for the maximum entropy problem with any number of moment constraints, the entropy is consi...
متن کاملNew Adaptive UKF Algorithm to Improve the Accuracy of SLAM
SLAM (Simultaneous Localization and Mapping) is a fundamental problem when an autonomous mobile robot explores an unknown environment by constructing/updating the environment map and localizing itself in this built map. The all-important problem of SLAM is revisited in this paper and a solution based on Adaptive Unscented Kalman Filter (AUKF) is presented. We will explain the detailed algorithm...
متن کاملThe Coupon-collector Problem Revisited — a Survey of Engineering Problems and Computational Methods
A standard combinatorial problem is to estimate the number (T ) of coupons, drawn at random, needed to complete a collection of all possible m types. Generalizations of this problem have found many engineering applications. The usefulness of the model is hampered by the difficulties in obtaining numerical results for moments or distributions. We show two computational paradigms that are well su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016